On Parallel Hierarchies and Rik
نویسنده
چکیده
This paper de nes natural hierarchies of function and relation classes, constructed from parallel complexity classes in a manner analogous to the polynomial-time hierarchy. A number of structural results about these classes are proven: relationships between them and the levels of PH; relationships between these classes and de nability in the bounded arithmetic theoriesR k; and several results relating conservation among theories of bounded arithmetic to the collapse of complexity classes.
منابع مشابه
A Study on the Value Systems of the Fourth Region of the I.A.U
This paper aims to study and examine the value systems among the students region of Islamic Azad universities. The population includes all students in academic year 2008-9 among whom 400 ones were selected from 10 universities as a sample. The students' value hierarchies were examined using Alpourt 45- item questionnaire(A.V.L). Descriptive and t-inferential statistics and multivariate variance...
متن کاملFast BVH Construction on GPUs
We present two novel parallel algorithms for rapidly constructing bounding volume hierarchies on manycore GPUs. The first uses a linear ordering derived from spatial Morton codes to build hierarchies extremely quickly and with high parallel scalability. The second is a top-down approach that uses the surface area heuristic (SAH) to build hierarchies optimized for fast ray tracing. Both algorith...
متن کاملApplication of modified balanced iterative reducing and clustering using hierarchies algorithm in parceling of brain performance using fMRI data
Introduction: Clustering of human brain is a very useful tool for diagnosis, treatment, and tracking of brain tumors. There are several methods in this category in order to do this. In this study, modified balanced iterative reducing and clustering using hierarchies (m-BIRCH) was introduced for brain activation clustering. This algorithm has an appropriate speed and good scalability in dealing ...
متن کاملOn Nets with Structured Concurrency
An extension of Petri nets with a statechart-like AND/OR state hierarchy is defined and studied. The resulting net variant, statechart nets, is shown to coincide, under certain conditions, with a strict subclass of safe nets in which concurrency is structured. Next, syntactic constraints on statechart nets are defined that guarantee absence of deadlocks and livelocks. Such syntactic constraints...
متن کاملCompleting Knowledge by Competing Hierarchies
A control strategy for expert systems is presented which is based on Shafer's Belief theory and the combination rule of Dempster. In contrast to well known strategies it is not sequentially and hypotheses-driven, but parallel and self organizing, determined by the concept of information gain. The information gain, calculated as the maximal difference between the actual evidence distribution in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Ann. Pure Appl. Logic
دوره 89 شماره
صفحات -
تاریخ انتشار 1997